Distributed Optimization Using the Primal-Dual Method of Multipliers

© 2015 IEEE. In this paper, we propose the primal-dual method of multipliers (PDMM) for distributed optimization over a graph. In particular, we optimize a sum of convex functions defined over a graph, where every edge in the graph carries a linear equality constraint. In designing the new algorithm, an augmented primal-dual Lagrangian function is constructed which smoothly captures the graph topology. It is shown that a saddle point of the constructed function provides an optimal solution of the original problem. Further under both the synchronous and asynchronous updating schemes, PDMM has the convergence rate of O(1/K) (where K denotes the iteration index) for general closed, proper, and convex functions. Other properties of PDMM such as convergence speeds versus different parameter-settings and resilience to transmission failure are also investigated through the experiments of distributed averaging

Sleep apnea detection using time-delayed heart rate variability

Sleep apnea is a sleep disorder distinguished by repetitive absence of breathing. Compared with the traditional expensive and cumbersome methods, sleep apnea diagnosis or screening with physiological information that can be easily acquired is needed. This paper describes algorithms using heart rate variability (HRV) to automatically detect sleep apneas as long as it can be easily acquired with unobtrusive sensors. Because the changes in cardiac activity are usually hysteretic than the presence of apneas with a few minutes, we propose to use the delayed HRV features to identify the episodes with sleep apneic events. This is expected to help improve the apnea detection performance. Experiments were conducted with a data set of 23 sleep apnea patients using support vector machine (SVM) classifiers and cross validations. Results show that using eleven HRV features with a time delay of 1.5 minutes rather than the features without time delay for SA detection, the overall accuracy increased from 74.9% to 76.2% and the Cohen's Kappa coefficient increased from 0.49 to 0.52. Further, an accuracy of 94.5% and a Kappa of 0.89 were achieved when applying subject-specific classifiers

Sleep apnea detection using time-delayed heart rate variability

Sleep apnea is a sleep disorder distinguished by repetitive absence of breathing. Compared with the traditional expensive and cumbersome methods, sleep apnea diagnosis or screening with physiological information that can be easily acquired is needed. This paper describes algorithms using heart rate variability (HRV) to automatically detect sleep apneas as long as it can be easily acquired with unobtrusive sensors. Because the changes in cardiac activity are usually hysteretic than the presence of apneas with a few minutes, we propose to use the delayed HRV features to identify the episodes with sleep apneic events. This is expected to help improve the apnea detection performance. Experiments were conducted with a data set of 23 sleep apnea patients using support vector machine (SVM) classifiers and cross validations. Results show that using eleven HRV features with a time delay of 1.5 minutes rather than the features without time delay for SA detection, the overall accuracy increased from 74.9% to 76.2% and the Cohen's Kappa coefficient increased from 0.49 to 0.52. Further, an accuracy of 94.5% and a Kappa of 0.89 were achieved when applying subject-specific classifiers